- Title
- A linear time algorithm for embedding chord graphs into certain necklace and windmill graphs
- Creator
- Rajalaxmi, T. M.; Parthiban, N.; Ryan, Joe; Shantrinal, A. Arul; Rajan, R. Sundara
- Relation
- Discrete Mathematics Letters Vol. 3, p. 50-56
- Relation
- https://www.dmlett.com/archive/DML20_v3_50_56.pdf
- Publisher
- Discrete Mathematics Letters
- Resource Type
- journal article
- Date
- 2020
- Description
- Wirelength is a salient feature to authenticate the quality of an embedding of a guest graph into a host graph and is used specifically in Very Large Scale Integration (VLSI) layout designs. The chord graph is an influential topology in the sphere of peer-to-peer networks. Thus, it is interesting to study the embedding of chord graphs into networks. In this paper, we have computed the exact wirelength of chord graphs into necklace and windmill graphs. Further, we have developed a linear time algorithm to compute the wirelength.
- Subject
- embedding; wirelength; chord graph; necklace graph; windmill graph
- Identifier
- http://hdl.handle.net/1959.13/1494701
- Identifier
- uon:53858
- Identifier
- ISSN:2664-2557
- Language
- eng
- Reviewed
- Hits: 231
- Visitors: 231
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|